Recent Results on Douglas–rachford Methods

نویسندگان

  • Francisco J. Aragón Artacho
  • Jonathan M. Borwein
  • Matthew K. Tam
  • N. Ribarska
  • Vladimir Veliov
چکیده

Recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems are described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems

We discuss recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems.

متن کامل

On the order of the operators in the Douglas-Rachford algorithm

The Douglas–Rachford algorithm is a popular method for finding zeros of sums of monotone operators. By its definition, the Douglas–Rachford operator is not symmetric with respect to the order of the two operators. In this paper we provide a systematic study of the two possible Douglas–Rachford operators. We show that the reflectors of the underlying operators act as bijections between the fixed...

متن کامل

A Cyclic Douglas-Rachford Iteration Scheme

In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our metho...

متن کامل

Douglas–Rachford Feasibility Methods for Matrix Completion Problems

In this paper we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and non-convex real matrix-completion problems. These guidelines are demonstrated by various illustrative examples.

متن کامل

The Douglas-Rachford Algorithm for Weakly Convex Penalties

The Douglas-Rachford algorithm is widely used in sparse signal processing for minimizing a sum of two convex functions. In this paper, we consider the case where one of the functions is weakly convex but the other is strongly convex so that the sum is convex. We provide a condition that ensures the convergence of the same Douglas-Rachford iterations, provided that the strongly convex function i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014